Limitations to Fréchet’s Metric Embedding Method
نویسندگان
چکیده
Fréchet’s classical isometric embedding argument has evolved to become a major tool in the study of metric spaces. An important example of a Fréchet embedding is Bourgain’s embedding [4]. The authors have recently shown [2] that for every ε > 0 any n-point metric space contains a subset of size at least n1−ε which embeds into `2 with distortion O ( log(2/ε) ε ) . The embedding used in [2] is non-Fréchet, and the purpose of this note is to show that this is not coincidental. Specifically, for every 2 > 0, we construct arbitrarily large n-point metric spaces, such that the distortion of any Fréchet embedding into `p on subsets of size at least n is Ω ( (log n) ) .
منابع مشابه
Phishing website detection using weighted feature line embedding
The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...
متن کاملThe embedding method to obtain the solution of fuzzy linear systems
In this paper, we investigate the general fuzzy linear system of equations. The main aim of this paper is based on the embedding approach. We find the necessary and sufficient conditions for the existence of fuzzy solution of the mentioned systems. Finally, Numerical examples are presented to more illustration of the proposed model.
متن کاملLarge Margin Local Metric Learning
Linear metric learning is a widely used methodology to learn a dissimilarity function from a set of similar/dissimilar example pairs. Using a single metric may be a too restrictive assumption when handling heterogeneous datasets. Recently, local metric learning methods have been introduced to overcome this limitation. However, they are subjects to constraints preventing their usage in many appl...
متن کاملStreaming Embeddings with Slack
We study the problem of computing low-distortion embeddings in the streaming model. We present streaming algorithms that, given an n-point metric space M , compute an embedding of M into an n-point metric space M ′ that preserves a (1−σ)-fraction of the distances with small distortion (σ is called the slack). Our algorithms use space polylogarithmic in n and the spread of the metric. Within suc...
متن کاملOvercoming the `1 Non-Embeddability Barrier: Algorithms for Product Metrics
A common approach for solving computational problems over a difficult metric space is to embed the “hard” metric into L1, which admits efficient algorithms and is thus considered an “easy” metric. This approach has proved successful or partially successful for important spaces such as the edit distance, but it also has inherent limitations: it is provably impossible to go below certain approxim...
متن کامل